Algorithms for Trip-Vehicle Assignment in Ride-Sharing
نویسندگان
چکیده
We investigate the ride-sharing assignment problem from an algorithmic resource allocation point of view. Given a number of requests with source and destination locations, and a number of available car locations, the task is to assign cars to requests with two requests sharing one car. We formulate this as a combinatorial optimization problem, and show that it is NP-hard. We then design an approximation algorithm which guarantees to output a solution with at most 2.5 times the optimal cost. Experiments are conducted showing that our algorithm actually has a much better approximation ratio (around 1.2) on synthetically generated data.
منابع مشابه
Solving the Ride-Sharing Problem with Non-Homogeneous Vehicles by Using an Improved Genetic Algorithm with Innovative Mutation Operators and Local Search Methods
An increase in the number of vehicles in cities leads to several problems, including air pollution, noise pollution, and congestion. To overcome these problems, we need to use new urban management methods, such as using intelligent transportation systems like ride-sharing systems. The purpose of this study is to create and implement an improved genetic algorithms model for ride-sharing with non...
متن کاملOn-demand high-capacity ride-sharing via dynamic trip-vehicle assignment
Ride-sharing services are transforming urban mobility by providing timely and convenient transportation to anybody, anywhere, and anytime. These services present enormous potential for positive societal impacts with respect to pollution, energy consumption, congestion, etc. Current mathematical models, however, do not fully address the potential of ride-sharing. Recently, a large-scale study hi...
متن کاملAnalyzing the Dynamic Ride-sharing Potential for Shared Autonomous Vehicle Fleets Using Cellphone Data from Orlando, Florida
Transportation network companies (TNCs) are regularly demonstrating the economic and operational viability of dynamic ride-sharing (DRS) to any destination within a city (e.g., uberPOOL or Lyft Line), thanks to real-time information from smartphones. In the foreseeable future, fleets of shared automated vehicles (SAVs) may largely eliminate the need for human drivers, while lowering per-mile op...
متن کاملA New Method for Optimization of Dynamic Ride Sharing System
Dynamic ridesharing is a profitable way to reduce traffic and carbon emissions by providing an opportunity for a flexible and affordable service that utilizes vehicle seating space. Matching of ride seeker requests with the rides, distributed over the roads is a tedious work. While fulfilling the request of all passengers, the total travel distance of the trip may get increased. Therefore, this...
متن کاملTaxi and Ride Sharing: A Dynamic Dial-a-Ride Problem with Money as an Incentive
This paper deals with a combinatorial optimization problem that models situations of both dynamic ridesharing and taxi-sharing. Passengers who want to share a taxi or a ride, use an app to specify their current location, destination and further information such as the earliest departure time, the latest arrival time and the maximum cost they are willing to pay for the ride. Car owners also spec...
متن کامل